Graph Matching a Skeletonized Theoretical Morphospace with a Cladogram for Gomphonemoid-cymbelloid Diatoms (bacillariophyta)

نویسنده

  • JANICE L. PAPPAS
چکیده

A three-dimensional (3D) theoretical morphospace of gomphonemoid and cymbelloid diatoms was skeletonized using concepts from extended Reeb graph analysis and Morse theory. The resultant skeleton tree was matched to a cladogram of the same group of related taxa using adjacency matrices of the trees and ordinated with multidimensional scaling (MDS) of leaf nodes. From this, an unweighted path matrix based on the number of branches between leaf nodes was ordinated to determine degree of matched tree structures. A constrained MDS of the path matrix, weighted by ranked MDS leaf node groups as facets, was used to interpret taxon environmental tolerances and habitat preferences with respect to adaptive value. The methods developed herein provided a way to combine results from morphological and phylogenetic analyses and interpret those results with respect to an aspect of evolutionary process, namely, adaptation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

More on Theoretical Morphospace and Its Relation to Freshwater Gomphonemoid-cymbelloid Diatom (bacillariophyta) Lineages

All forms from hypothesized gomphonemoid-cymbelloid lineages were constructed using three-dimensional (3D) parametric equations with the same boundary intervals for all forms. To construct a theoretical morphospace, the absolute value of the Riemann sum of differences between pairs of forms in terms of surfaces in the x-, yand z-directions was determined and plotted in 3D space. In general, nav...

متن کامل

Theoretical Morphospace and Its Relation to Freshwater Gomphonemoid–cymbelloid Diatom (bacillariophyta) Lineages

A number of basic forms in the gomphonemoid–cymbelloid diatom lineages were generated using three-dimensional (3D) parametric equations. The same boundary intervals and differentials for the parameters were used for all forms. From this, the absolute value of the Riemann sum of differences was determined for each variable between pairs of forms. The results were coordinate triplets, and they we...

متن کامل

ON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH

Uncertain graphs are employed to describe graph models with indeterministicinformation that produced by human beings. This paper aims to study themaximum matching problem in uncertain graphs.The number of edges of a maximum matching in a graph is called matching numberof the graph. Due to the existence of uncertain edges, the matching number of an uncertain graph is essentially an uncertain var...

متن کامل

Matching Integral Graphs of Small Order

In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011